Counting Integer Flows in Networks
نویسندگان
چکیده
This paper discusses analytic algorithms and software for the enumeration of all integer flows inside a network. Concrete applications abound in graph theory, representation theory, and statistics. Our methods are based on the study of rational functions with poles on arrangements of hyperplanes; they surpass traditional exhaustive enumeration and can even yield formulas when the input data contains some parameters. We also discuss the calculation of chambers in detail because it is a necessary subroutine.
منابع مشابه
Inside-Out Polytopes
We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an integer whose parts are partially distinct, and generalized latin squares. Our method is to generalize Ehrhart’s theory of lattice-point counting to a convex pol...
متن کاملEffects of integrating physical and financial flows through a closed-loop supply chain network under uncertain demand and return
The impact of financial challenges on the profit of a supply chain, have caused the researcher to model the supply chain network by considering the operational and financial dimensions. Also, the establishment of a closed loop supply chain (CLSC) network has a high effect on economic profit. So, the purpose of this study is to design a stochastic closed loop supply chain network by considering ...
متن کاملOptimal energy management of the photovoltaic based distribution networks considering price responsive loads, energy storage systems and convex power flows.
Nowadays, presence of photovoltaic systems in distribution network is not without challenge and it may not have economic productivity for the system under the lack of optimal management. Energy storage systems are able to cope with this problem. Therefore, in this paper, a new method is proposed for energy management of the distribution networks in order to show that how presence of the energy ...
متن کاملOptimal Design of the Cross-docking in Distribution Networks: Heuristic Solution Approach
A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Foundations of Computational Mathematics
دوره 4 شماره
صفحات -
تاریخ انتشار 2004